Monadic Constraint Programming with Gecode
نویسندگان
چکیده
This paper presents FD-MCP, a finite domain modeling language on top of the Monadic Constraint Programming framework for Haskell. FD-MCP leverages Haskell’s rich static type system and powerful abstraction mechanisms for implementing syntactic sugar, model transformations and compilation to solver backends. Two backends are provided: a basic Haskell solver and a Gecode code generator. Our benchmarks establish that FD-MCP models are much more concise than handcoded Gecode programs, more so when using disjunction, without sacrificing performance.
منابع مشابه
Expressive Models for Monadic Constraint Programming
This paper presents a new FD-specific modeling front-end for the Monadic Constraint Programming framework for Haskell. A more declarative interface was introduced, supporting reified constraints among others, as well as an optimizing compilation scheme to prevent the inefficiencies that high-level modeling typically introduces. Problems can be solved directly at run-time, or translated to C++ c...
متن کاملSolving XCSP problems by using Gecode
Gecode is one of the most efficient libraries that can be used for constraint solving. However, using it requires dealing with C++ programming details. On the other hand several formats for representing constraint networks have been proposed. Among them, XCSP has been proposed as a format based on XML which allows us to represent constraints defined either extensionally or intensionally, permit...
متن کاملDecomposition During Search for Propagation-Based Constraint Solvers
We describe decomposition during search (DDS), an integration of and/or tree search into propagation-based constraint solvers. The presented search algorithm dynamically decomposes sub-problems of a constraint satisfaction problem into independent partial problems, avoiding redundant work. The paper discusses how DDS interacts with key features that make propagation-based solvers successful: co...
متن کاملA portable and efficient implementation of global constraints: the tree constraint case
Global constraints represent invaluable modeling tools for Constraint Programming (CP). Efficiently solving recurrent subproblems is a key point for CP successes. However, global constraints mainly remain strongly attached to a given constraint solver. Indeed, they heavily rely on internal mechanisms in order to be as efficient as possible. In this paper, we emphasize the interest of decoupling...
متن کاملCompiling and Executing Declarative Modeling Languages to Gecode
We developed a compiler from SICStus Prolog CLP(FD) to Gecode and a compiler from MiniZinc to Gecode. We compared the running times of the executions of (standard) codes directly in the three languages and of the compiled codes for some classical problems. Performances of the compiled codes in Gecode improve those in the original languages and are comparable with running time of native Gecode c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009